An algorithm to generate tournament score sequences
نویسندگان
چکیده
منابع مشابه
Calculating the Frequency of Tournament Score Sequences
We indicate how to calculate the number of round-robin tournaments realizing a given score sequence. This is obtained by inductively calculating the number of tournaments realizing a score function. Tables up to 18 participants are obtained. 1. Tournaments and score sequences A (round-robin) tournament on a set P of n vertices (participants, teams, . . . ) is a directed graph obtained by orient...
متن کاملTransitive partitions in realizations of tournament score sequences
A tournament is an oriented complete graph, and one containing no directed cycles is called transitive. A tournament T= (V,A) is called m-partition transitive if there is a partition V=X1∪· X2∪· · · ·∪· Xm such that the subtournaments induced by each Xi are all transitive, and T Contract grant sponsor: University of Dayton Research Council (to A. H. B.); Contract grant sponsor: National Science...
متن کاملTournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 ≤ 2ti. A Meeussen sequence is an increasing sequence of positive integers (m1, m2, . . .) such that m1 = 1, every nonnegative integer is the sum of a subset of the {mi}, and each integer mi − 1 is the sum of a unique such subset. We show that these two properties are isomorphic. That i...
متن کاملAn optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as input. We first recall some useful results, namely the distributive lattice structure of the space of tilings and Thurston’s algorithm for constructing a particular tiling. We then describe our algorithm and study its...
متن کامل0 Tournament Sequences and Meeussen Sequences
A tournament sequence is an increasing sequence of positive integers (t1, t2, . . .) such that t1 = 1 and ti+1 ≤ 2ti. A Meeussen sequence is an increasing sequence of positive integers (m1,m2, . . .) such that m1 = 1, every nonnegative integer is the sum of a subset of the {mi}, and each integer mi − 1 is the sum of a unique such subset. We show that these two properties are isomorphic. That is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2003
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(03)00013-x